Optimal Pruning for Multi-Step Sensor Scheduling
نویسندگان
چکیده
منابع مشابه
Optimal Sensor Scheduling via Non-standard Multi-armed Bandit Formulation
This paper addresses optimal sensor scheduling for maximizing network lifetime. We formulate this problem as a nonstandard multi-armed bandit process with non-discounted reward and finite stopping time. We find that the optimal strategy should choose the sensor that has the largest Gittins’ index. Exploiting the underlying structure of sensor scheduling problem, we reduce the computational comp...
متن کاملOptimal sensor scheduling for Hidden Markov models
Consider the Hidden Markov model where the realization of a single Markov chain is observed by a number of noisy sensors. The sensor scheduling problem for the resulting Hidden Markov model is as follows: Design an optimal algorithm for selecting at each time instant, one of the many sensors to provide the next measurement. Each measurementhas an associatedmeasurementcost. The problem is to sel...
متن کاملOptimal Sensor Scheduling Algorithms for Distributed Sensor Networks
In this paper, a sensor network is used to estimate the dynamic states of a system. At each time step, one (or multiple) sensors are available that can send its measured data to a central node, in which all of processing is done. We want to provide an optimal algorithm for scheduling sensor selection at every time step. Our goal is to select the appropriate sensor to reduce computations, optimi...
متن کاملMulti-Step Multi-Sensor Hider-Seeker Games
We study a multi-step hider-seeker game where the hider is moving on a graph and, in each step, the seeker is able to search c subsets of the graph nodes. We model this game as a zero-sum Bayesian game, which can be solved in weakly polynomial time in the players’ action spaces. The seeker’s action space is exponential in c, and both players’ action spaces are exponential in the game horizon. T...
متن کاملTwo-step optimal thermal generation scheduling
A new approach to the solution of the optimal thermal generation scheduling problem is presented. The problem is solved in two steps. As a first step, the optimal production schedule for the next day is obtained based on a daily load forecast, reserve capacity requirements, and present status of generating units. The second-step algorithm uses the results of the first step and adjusts the previ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: IEEE Transactions on Automatic Control
سال: 2012
ISSN: 0018-9286,1558-2523
DOI: 10.1109/tac.2011.2175070